Effective Prover for Minimal Inconsistency Logic
نویسندگان
چکیده
In this paper we present an effective prover for mbC, a minimal inconsistency logic. The mbC logic is a paraconsistent logic of the family of logics of formal inconsistency. Paraconsistent logics have several philosophical motivations as well as many applications in Artificial Intelligence such as in belief revision, inconsistent knowledge reasoning, and logic programming. We have implemented the KEMS prover for mbC, a theorem prover based on the KE tableau method for mbC. We show here that the proof system on which this prover is based is sound, complete and analytic. To evaluate the KEMS prover for mbC, we devised four families of mbC-valid formulas and we present here the first benchmark results using these families.
منابع مشابه
The Inconsistency in Gödel's Ontological Argument: A Success Story for AI in Metaphysics
This paper discusses the discovery of the inconsistency in Gödel’s ontological argument as a success story for artificial intelligence. Despite the popularity of the argument since the appearance of Gödel’s manuscript in the early 1970’s, the inconsistency of the axioms used in the argument remained unnoticed until 2013, when it was detected automatically by the higher-order theorem prover Leo-...
متن کاملA KE Tableau for a Logic of Formal Inconsistency
In this paper we describe a KE tableau system for a Logic of Formal Inconsistency (LFI) called mCi. The family of LFIs is a family of paraconsistent logics with philosophical relevance and applications in computer science. We prove that the KE System for mCi is correct and complete, and describe the implementation of such a system, presenting the strategies designed for the actual implementatio...
متن کاملTheorem Proving and Model Building with the Calculus KE
A Prolog implementation of a new theorem-prover for rst-order classical logic is described. The prover is based on the calculus KE and the rules used for analysing quantiiers in free variable semantic tableaux. A formal speciication of the rules used in the implementation is described, for which soundness and completeness is straightforwardly veriied. The prover has been tested on the rst 47 pr...
متن کاملA Minimal-Cost Inherent-Feedback Approach for Low-Power MRF-Based Logic Gates
The Markov random field (MRF) theory has been accepted as a highly effective framework for designing noise-tolerant nanometer digital VLSI circuits. In MRF-based design, proper feedback lines are used to control noise and keep the circuits in their valid states. However, this methodology has encountered two major problems that have limited the application of highly noise immune MRF-based circui...
متن کاملDisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover
In this paper, we describe a disjunctive logic programming system, referred to as Dis-LoP, based on PROTEIN theorem prover. PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs. In particular, restart model elimination calculus is answer complete for postive queries. The Dis...
متن کامل